OPTIMIST: A New Conflict Resoution Algorithm for ACT–R
نویسندگان
چکیده
Several studies have suggested recently that a more dynamic conflict resolution mechanism in the ACT–R cognitive architecture (Anderson & Lebiere, 1998) could improve the decision–making behaviour of cognitive models. This part of ACT–R theory is revisited and a new solution is proposed. The new algorithm (OPTIMIST) has been implemented as an overlay to the ACT–R architecture, and can be used as an alternative mechanism. The operation of the new algorithm is tested in a model of the Yerkes and Dodson experiment on animals’ learning. When OPTIMIST is used, the resulting model fits the data better (e.g. R increases from .85 to .93 in one example).
منابع مشابه
OPTIMIST: A New Conflict Resolution Algorithm for ACT-R
Several studies have suggested recently that a more dynamic conflict resolution mechanism in the ACT–R cognitive architecture (Anderson & Lebiere, 1998) could improve the decision–making behaviour of cognitive models. This part of ACT–R theory is revisited and a new solution is proposed. The new algorithm (OPTIMIST) has been implemented as an overlay to the ACT–R architecture, and can be used a...
متن کاملOPTIMIST Conflict Resolution Overlay for the ACT–R Cogntivie Architecture∗
This is a documentation on the OPTIMIST overlay for the ACT–R cognitive architecture (Anderson & Lebiere, 1998). The overlay implements an alternative conflict resolution algorithm. The main difference of the new algorithm from the ‘standard’ is the use of Gamma distributed noise, which has rule–specific and dynamic variance as opposed to normal distributed noise with global and constant variance.
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملConflict Resolution by Random Estimated Costs
Conflict resolution is an important part of many intelligent systems such as production systems, planning tools and cognitive architectures. For example, the ACT–R cognitive architectire [Anderson and Lebiere, 1998] uses a powerful conflict resolution theory that allowed for modelling many characteristics of human decision making. The results of more recent works, however, pointed to the need o...
متن کاملMobile Sink Data Gathering Technique for Wireless Sensor Networks using PSO
To overcome the challenges of Data gathering and enhancement of lifetime of mobile nodes we propose a new data gathering technique with multiple mobile sinks based on particle swarm optimization (PSO) technique. Particle changes its condition according to the following three principles in the basic particle swarm optimization algorithm: (1) to keep its inertia (2) to change the condition accord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004